منابع مشابه
Lex-Optimal Multiclass Scheduling with Deadlines
A new optimality criterion and associated scheduling and dropping algorithm are presented for multiclass packets with deadlines. Equal length packets with deadlines and priority labels are either scheduled by their deadlines or dropped on or possibly before their deadlines. An L-bit priority label is used to handle up to 2 priority classes. A scheduling policy is called lex-optimal within the c...
متن کاملOptimal Scheduling of Contract Algorithms with Soft Deadlines
A contract algorithm is an algorithm which is given, as part of its input, a specified amount of allowable computation time. In contrast, interruptible algorithms may be interrupted throughout their execution, at which point they must report their current solution. Simulating interruptible algorithms by means of schedules of executions of contract algorithms in parallel processors is a wellstud...
متن کاملLex-Optimal Online Multiclass Scheduling with Hard Deadlines
On-line scheduling of unit-length packets with hard deadlines by a single server in slotted time is considered. First, the throughput optimal scheduling policies are characterized. Then multiclass packets are considered in which each packet has an M -bit class identifier, and a new optimality property called lex-optimality (short for lexicographic optimality) is defined for on-line scheduling p...
متن کاملOnline Scheduling with Hard Deadlines
We study non-preemptive, online admission control in the hard deadline model: each job must be either serviced prior to its deadline, or be rejected. Our setting consists of a single resource that services an online sequence of jobs; each job has a length indicating the length of time for which it needs the resource, and a delay indicating the maximum time it can wait for the service to be star...
متن کاملConditional Scheduling with Varying Deadlines
We examine a conditional scheduling model in which the deadlines of jobs are allowed to vary. We explore variants of the basic model and locate the dividing line between NP-hard and polynomial-time problems. Suppose that an engineer needs to design one of two devices, either A or B. Each device will require nine months of work. The due date of both A and B is in one year, but only one device wi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Automatic Control
سال: 1989
ISSN: 0018-9286
DOI: 10.1109/9.29398